Quantum money with nearly optimal error tolerance
نویسندگان
چکیده
منابع مشابه
Quantum Error Correction and Fault-Tolerance
I give an overview of the basic concepts behind quantum error correction and quantum fault tolerance. This includes the quantum error correction conditions, stabilizer codes, CSS codes, transversal gates, fault-tolerant error correction, and the threshold theorem. 1 Quantum Error Correction Building a quantum computer or a quantum communications device in the real world means having to deal wit...
متن کاملOptimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money
We present an analysis of Wiesner’s quantum money scheme, as well as some natural generalizations of it, based on semidefinite programming. For Wiesner’s original scheme, it is determined that the optimal probability for a counterfeiter to create two copies of a bank note from one, where both copies pass the bank’s test for validity, is (3/4)n for n being the number of qubits used for each note...
متن کاملTopological Quantum Error Correction with Optimal Encoding Rate
Quantum computation has overcome major difficulties and has become a field of solid research. On the theoretical side, several models of quantum computation are already proposed like the quantum network model using a set of universal logic gates. Quantum error correction and fault tolerant quantum computation have been proved to be well established theoretically. On the experimental side, test-...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملSet reconciliation with nearly optimal communication complexity
We consider the problem of efficiently reconciling two similar sets held by different hosts while minimizing the communication complexity, which we call the set reconciliation problem. We describe an approach to set reconciliation based on a polynomial encoding of sets. The resulting protocols exhibit tractable computational complexity and nearly optimal communication complexity when the sets b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.062334